//485
int findMaxConsecutiveOnes(int* nums, int numsSize)
{
    int count=0;
    int index=-1;
    int max=0;
    int tmp=0;
    for(int i=0;i<numsSize;i++)
    {
        if(nums[i]==1)
        {
            count++;
            index=1;
        }
        if(nums[i]==0)
        {
            index=0;
            tmp=count;
            max=max>tmp?max:tmp;
            count=0;
        }
    }
    tmp=count;
    max=max>tmp?max:tmp;
    return max;
}